UCG-E: An Equational Logic Programming System
نویسنده
چکیده
UCG-E (Hamel, 1991) is an equational logic programming system inspired by O’Donnell’s system (O’Donnell, 1985) and was designed to allow the integration of logic systems into imperative style programming environments. Equational logic systems are interesting, since they may be implemented very efficiently with term rewriting systems (Herman, 1991). Backtracking, a major source of inefficiencies in other logic systems, is unnecessary in equational logic if the confluency of the underlying rewriting system is guaranteed. O’Donnell has identified four restrictions to the form of the equational axioms which assure the confluency of a system. Since the restrictions are purely syntactical, no runtime checks need to be performed to see whether a transformation is legal or not.
منابع مشابه
A Category-Based Equational Logic Semantics to Constraint Programming
This paper exploits the point of view of constraint programming as computation in a logical system, namely constraint logic. We dene the basic ingredients of constraint logic, such as constraint models and generalised polynomials. We show that constraint logic is an institution , and we internalise the study of constraint logic to the framework of category-based equational logic. By showing tha...
متن کاملNarrowing and Rewriting Logic: from Foundations to Applications
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both cases, narrowing supports equational reasoning and assumes confluent equations. The main goal of this work is to show that narrowing can be greatly generalized, so as to support a much wider range of applications, when ...
متن کاملA Method for Implementing Equational Theories as Logic Programs
Equational theories underly many elds of computing, including functional programming, symbolic algebra, theorem proving, term rewriting and constraint solving. In this paper we show a method for implementing many equational theories with a limited class of logic programs. We de ne regular equational theories, a useful class of theories, and illustrate with a number of examples how our method ca...
متن کاملCategory-based Semantics for Equational and Constraint Logic Programming
This thesis proposes a general framework for equational logic programming, called catf:gory based equational logic by placing the general principles underlying the design of the pro gramming language Eqlog and formulated by Goguen and Meseguer into an abstract form. This framework generalises equational deduction to an arbitrary category satisfy ing certain natural conditions; completeness i...
متن کاملE-Generalization Using Grammars
We extend the notion of anti-unification to cover equational theories and present a method based on regular tree grammars to compute a finite representation of E-generalization sets. We present a framework to combine Inductive Logic Programming and E-generalization that includes an extension of Plotkin’s lgg theorem to the equational case. We demonstrate the potential power of E-generalization ...
متن کامل